Penentuan Rute Distribusi Menggunakan Model Integer Linear Programming dengan Metode Branch and Bound
نویسندگان
چکیده
منابع مشابه
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today that is the use of branch and bound to handle discrete constructs, which, while often formally representable in terms of zero-one integer variables, can be handled more elegantly and effectively by applying branch and boun...
متن کاملCytotoxic effect of γ-sitosterol from Kejibeling (Strobilanthes crispus) and its mechanism of action towards c-myc gene expression and apoptotic pathway
Metode: Penelitian in vitro ini menggunakan kultur sel kanker kolon manusia (Caco-2), sel kanker hepar manusia (HepG2), sel kanker payudara tergantung hormon (MCF7) dan kultur sel normal hepar manusia (Chang Liver). Efek sitotoksik diukur melalui uji MTT melalui penentuan kadar yang membunuh 50% sel (IC50). Mekanisme sitotoksik dipelajari dengan menentukan pengaruh penambahan γ-sitosterol pada ...
متن کاملBranch-and-bound for biobjective mixed-integer programming
We present a generic branch-and-bound method for finding all the Pareto solutions of a biobjective mixed integer program. Our main contribution is new algorithms for obtaining dual bounds at a node, for checking node fathoming, presolve and duality gap measurement. Our various procedures are implemented and empirically validated on instances from literature and a new set of hard instances. We a...
متن کاملMore Branch-and-Bound Experiments in Convex Nonlinear Integer Programming
Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MI...
متن کاملBranch-and-bound for bi-objective integer programming
In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Go-Integratif : Jurnal Teknik Sistem dan Industri
سال: 2020
ISSN: 2745-3510,2723-7842
DOI: 10.35261/gijtsi.v1i01.4265